
//BF算法
/*

public class Test {
    public static int BF(String str, String sub){
        if(str == null || sub == null){
            return -1;
        }
        int lenStr = str.length();
        int lenSub = sub.length();
        if(lenStr == 0 || lenSub == 0){
            return -1;
        }

        int i = 0;
        int j = 0;
        while(i < lenStr && j < lenSub){
            if(str.charAt(i) == sub.charAt(j)) {
                i++;
                j++;
            }else {
                i = i - j + 1;
                j = 0;
            }
        }

        if(j>=lenSub){
            return i - j;
        }
        return -1;
    }
    public static void main(String [] args){

        System.out.println(BF("bccde" ,"cde"));

    }
}
*/

/*
public class Test {
    public static void main(String[] args) {
//153 = 1^3 + 5^3 + 3^3
        for (int i = 0; i < 10000; i++) {
            int count = 0;//计算当前i 有几位数
            int tmp = i;
            while (tmp != 0) {
                count++;
                tmp = tmp / 10;
            }
//count的值 是多少已经计算完成   i还是没有变的
//计算i[tmp]的每一位
            tmp = i;
            int sum = 0;
            while(tmp != 0){
                sum+=Math.pow(tmp % 10, count);
                tmp /= 10;
            }
            if(sum == i){
                System.out.println(i);
            }
        }
    }
}*/

/*public class Test{
    public static void main(String [] args){
        int count = 0;
        for (int i = 1; i <= 100; i++) {
            if(i / 10 == 9){
                count++;
            }
            if(i % 10 == 9){
                count++;
            }
        }
        System.out.println(count);
    }
}*/

/*

import java.util.Scanner;

public class Test {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int k = (int)Math.sqrt(n);
        int i = 2;
        for (; i <= k; i++) {
            if(n % i == 0){
                System.out.println("不是素数");
                break;
            }
        }
        if(i == k+ 1){
            System.out.println("是素数");
        }
    }
}
*/


//求2进制中1的个数
/*
public class Test{
    public static void main(String [] args){
        int a = 7;
        int count = 0;
        while(a!=0){
            a&=(a-1);
            count++;
        }
        System.out.println(count);
    }
}*/
/*
public class Test{
    public static int sum(int a,int b){
        return a+b;
    }

    public static void main(String[] args){
        int ret=sum(12,34);
        System.out.println(ret);
    }
}*/


//求阶乘的和
/*
public class Test {
    private static int fac(int n){
        int ret = 1;
        for (int i = 1; i <= n ; i++) {
            ret *= i;
        }
        return ret;
    }
    public static int facSum(int n){
        int sum = 0;
        for (int i = 1; i <= n; i++) {
            sum+=fac(i);
        }
        return sum;
    }
    public static void main(String[] args) {
        System.out.println(fac(3));
        int ret=facSum(3);
        System.out.println(ret);
    }
}*/
/*
//方法的重载
public class Test {
    public static int add(int a,int b){
        return a+b;
    }
    private static double add(double a,double b){
        return a+b;
    }
    public static int add(int a,int b, int c){
        return a+b+c;
    }
    public static void main(String[] args) {
       double a = add(12.2 ,12.2);
        System.out.println(a);
        int b=add(1,2,3);
        int c=add(2,3);
        int d=add(23,23);
        System.out.println(b);
    }
}*/
/*
public class Test {
    public static int max2(int a,int b){
        return a>b?a:b;
    }
    public static int max3(int a,int b,int c){
        return max2(max2(a,b),c);
    }
    public static void main(String[] args) {
        int ret=max3(6,4,3);
        System.out.println(ret);
    }
}*/
/*
import java.util.Scanner;
public class Test {
    public static int facSum(int n){
        int ret=1;
        int sum=0;
        for (int i = 1; i <= n; i++) {
            ret *= i;
            sum += ret;
        }
        return sum;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int ret = facSum(n);
        System.out.println(ret);
    }
}*/
/*

import java.util.Scanner;
public class Test {
    public static int fib(int n){
        if(n == 1 || n == 2){
            return 1;
        }
        int a = 1;
        int b = 1;
        int c = 0;
        for (int i = 2; i < n; i++) {
            c=a+b;
            a=b;
            b=c;
        }
        return c;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int ret = fib(n);
        System.out.println(ret);
        scanner.close();
    }
}
*/
/*

public class Test {
    public static int add(int a,int b){
        return a+b;
    }
    public static int add(int a,int b,int c){
        return a+b+c;
    }
    public static void main(String[] args) {
        System.out.println(add(1,2));
        System.out.println(add(1,2,3));
    }
}
*/


public class Test {
    public static int max(int x,int y){
        return x > y ? x : y;
    }
    public static double max(double x,double y,double z){
        double tmp = x > y ? x : y;
        return tmp > z ? tmp : z;
    }
    public static void main(String[] args) {
        System.out.println(max(1,3));
        System.out.println(max(1.1,2.2,3.3));
    }
}



